翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク string operations ： ウィキペディア英語版 string operations In computer science, in the area of formal language theory, frequent use is made of a variety of string functions; however, the notation used is different from that used on computer programming, and some commonly used functions in the theoretical realm are rarely used when programming. This article defines some of these basic terms. ==Strings and languages== A string is a finite sequence of characters. The empty string is denoted by $\backslash varepsilon$. The concatenation of two string $s$ and $t$ is denoted by $s\; \backslash cdot\; t$, or shorter by $s\; t$. Concatenating with the empty string makes no difference: $s\; \backslash cdot\; \backslash varepsilon\; =\; s\; =\; \backslash varepsilon\; \backslash cdot\; s$. Concatenation of strings is associative: $s\; \backslash cdot\; (t\; \backslash cdot\; u)\; =\; (s\; \backslash cdot\; t)\; \backslash cdot\; u$. For example, $(\backslash langle\; b\; \backslash rangle\; \backslash cdot\; \backslash langle\; l\; \backslash rangle)\; \backslash cdot\; (\backslash varepsilon\; \backslash cdot\; \backslash langle\; ah\; \backslash rangle)\; =\; \backslash langle\; bl\; \backslash rangle\; \backslash cdot\; \backslash langle\; ah\; \backslash rangle\; =\; \backslash langle\; blah\; \backslash rangle$. A language is a finite or infinite set of strings. Besides the usual set operations like union, intersection etc., concatenation can be applied to languages: if both $S$ and $T$ are languages, their concatenation $S\; \backslash cdot\; T$ is defined as the set of concatenations of any string from $S$ and any string from $T$, formally $S\; \backslash cdot\; T\; =\; \backslash$. Again, the concatenation dot $\backslash cdot$ is often omitted for shortness. The language $\backslash$ consisting of just the empty string is to be distinguished from the empty language $\backslash$. Concatenating any language with the former doesn't make any change: $S\; \backslash cdot\; \backslash \; =\; S\; =\; \backslash \; \backslash cdot\; S$, while concatenating with the latter always yields the empty language: $S\; \backslash cdot\; \backslash \; =\; \backslash \; =\; \backslash \; \backslash cdot\; S$. Concatenation of languages is associative: $S\; \backslash cdot\; (T\; \backslash cdot\; U)\; =\; (S\; \backslash cdot\; T)\; \backslash cdot\; U$. For example, abbreviating $D\; =\; \backslash$, the set of all three-digit decimal numbers is obtained as $D\; \backslash cdot\; D\; \backslash cdot\; D$. The set of all decimal numbers of arbitrary length is an example for an infinite language. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「string operations」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.